An O(n) Time Algorithm for Deciding Whether a Regular Language is a Code
نویسنده
چکیده
We describe an algorithm that, given as input a nondeterministic finite automaton A of size n, decides in O(n2) time whether the language accepted by A is a code. Let Σ be a finite alphabet. A language η ⊆ Σ∗ is a code if every string in η∗ is written uniquely as a concatenation of strings from η, or, equivalently, if η∗ is a free submonoid of Σ∗ and η is its minimal generating set.
منابع مشابه
An O(n 2 ) Time Algorithm for Deciding Whether a Regular Language Is a Code
We describe an algorithm that, given as input a nondeterministic nite automaton A of size n, decides in O(n 2) time whether the language accepted by A is a code. Let be a nite alphabet. A language is a code if every string in is written uniquely as a concatenation of strings from , or, equivalently , if is a free submonoid of and is its minimal generating set.
متن کاملTransducers and the Properties of Error-Detection, Error-Correction, and Finite-Delay Decodability
When the words of a language are communicated via a noisy channel, the language property of error-detection ensures that no word of the language can be transformed to another word of the language. On the other hand, the property of error-correction ensures that the channel cannot transform two different words of the language to the same word. In this work we use transducers to model noisy chann...
متن کاملDetermining exponential density and maximal encoding capabilities of a regular language
The density of a language is the function that returns, for each n, the number of words in the language of length n. In the first place, we consider deciding whether the density of a given regular language L is exponential. This question can be answered in linear time when L is given via a DFA. We show that the same question can be decided in quadratic time when L is given via an NFA. It turns ...
متن کاملLinear Sphericity Testing of 3-Connected Single Source Digraphs
It has been proved that sphericity testing for digraphs is an NP-complete problem. Here, we investigate sphericity of 3-connected single source digraphs. We provide a new combinatorial characterization of sphericity and give a linear time algorithm for sphericity testing. Our algorithm tests whether a 3-connected single source digraph with $n$ vertices is spherical in $O(n)$ time.
متن کاملChecking Determinism of Regular Expressions with Counting
We give characterizations of strong determinism for regular expressions with counting, based on which we present an O(|ΣE ||E|) time algorithm to check whether an expression E with counting is strongly deterministic where ΣE is the set of distinct symbols in E. It improves the previous upper bound of O(|E|) time on the same decision problems for both standard regular expressions and regular exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011